home *** CD-ROM | disk | FTP | other *** search
- Path: cs.uwa.edu.au!gordon
- From: gordon@cs.uwa.edu.au (Gordon Royle)
- Newsgroups: comp.lang.c
- Subject: Re: Algorithms needed
- Date: 27 Mar 96 03:17:09 GMT
- Organization: The University of Western Australia
- Message-ID: <gordon.827896629@cs.uwa.edu.au>
- References: <4j8jf9$1kr@styx.uwa.edu.au> <DovM4J.LE4@watserv3.uwaterloo.ca>
- NNTP-Posting-Host: wallaroo.cs.uwa.oz.au
- X-Newsreader: NN version 6.5.0 #3 (NOV)
-
- bcrwhims@uwaterloo.ca (Carsten Whimster) writes:
-
- >In <4j8jf9$1kr@styx.uwa.edu.au>, fechin@tartarus.uwa.edu.au (Paul McCormick) writes:
- >>1)write a approximation algorithm for the TRAVILING SALESMAN problem
- >>assume that triangle inequality is satisfied and a adjacency matrix is
- >>used.
- >>The program will only be allowed 400 seconds of CPU time to come up with
- >>the closest solution.
- >>
- >>2)Write a recursive search program that finds th HAMILTONIAN CYCLE of a
- >>graph
- >>
- >>3)Write a program that finds the diameter of a graph using BFS
- >>algorithm.
- >>
- >>If you have any solutions please mail them to me at
- >>fechin@tartarus.uwa.edu.au
-
- >If I knew the e-mail address of your prof, I would mail this straight to
- >him. Do you want to learn or do you just want to cheat your way through
- >school? I can't stand people like you, always asking me to help them out
- >by giving them solutions they never had to think about.
-
- Thank you Carsten for your kind thoughts.... I am the prof for the course
- in question, and I am indeed VERY interested in this posting.
-
- Fortunately the system administrators at the university picked this one up
- and let me know, so there will be a very interesting interview very soon..
-
- Thanks
-
- Gordon
- --
- Gordon Royle ---- gordon@cs.uwa.edu.au
- Visit http://www.cs.uwa.edu.au/~gordon
- --
-